//输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。 
//
// 
//
// 示例 1： 
//
// 输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
//输出：[1,2,3,6,9,8,7,4,5]
// 
//
// 示例 2： 
//
// 输入：matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
//输出：[1,2,3,4,8,12,11,10,9,5,6,7]
// 
//
// 
//
// 限制： 
//
// 
// 0 <= matrix.length <= 100 
// 0 <= matrix[i].length <= 100 
// 
//
// 注意：本题与主站 54 题相同：https://leetcode-cn.com/problems/spiral-matrix/ 
// Related Topics 数组 矩阵 模拟 👍 375 👎 0

package leetcode.editor.offer;

import java.util.ArrayList;
import java.util.List;

// 29. 顺时针打印矩阵
class ShunShiZhenDaYinJuZhenLcof {
    public static void main(String[] args) {
        Solution solution = new ShunShiZhenDaYinJuZhenLcof().new Solution();
//        int[][] ints = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
        int[][] ints = {{3}, {2}};
        solution.spiralOrder(ints);
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public int[] spiralOrder(int[][] matrix) {
            if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
                return new int[]{};
            }
            List<Integer> list = new ArrayList<>();
            int rows = matrix.length, columns = matrix[0].length; // 行列的数量
            int top = 0, button = rows - 1, right = columns - 1, left = 0;
            while (left <= right && top <= button) {
                // 遍历上边
                for (int column = left; column <= right; column++) {
                    list.add(matrix[top][column]);
                }
                // 遍历右边
                for (int row = top + 1; row <= button; row++) {
                    list.add(matrix[row][right]);
                }
                if (left < right && top < button) {
                    // 遍历下边
                    for (int column = right - 1; column > left; column--) {
                        list.add(matrix[button][column]);
                    }
                    // 遍历左边
                    for (int row = button; row > top; row--) {
                        list.add(matrix[row][left]);
                    }
                }

                left++;
                right--;
                top++;
                button--;
            }

            int[] ints = new int[list.size()];
            for (int i = 0; i < list.size(); i++) {
                ints[i] = list.get(i);
            }

            return ints;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}
